Maximum Multiplicity of a Root of the Matching Polynomial of a Tree and Minimum Path Cover
نویسندگان
چکیده
We give a necessary and sufficient condition for the maximum multiplicity of a root of the matching polynomial of a tree to be equal to the minimum number of vertex disjoint paths needed to cover it.
منابع مشابه
Maximum Multiplicity of Matching Polynomial Roots and Minimum Path Cover in General Graphs
Let G be a graph. It is well known that the maximum multiplicity of a root of the matching polynomial μ(G,x) is at most the minimum number of vertex disjoint paths needed to cover the vertex set of G. Recently, a necessary and sufficient condition for which this bound is tight was found for trees. In this paper, a similar structural characterization is proved for any graph. To accomplish this, ...
متن کاملAutomatic QoS-aware Web Services Composition based on Set-Cover Problem
By definition, web-services composition works on developing merely optimum coordination among a number of available web-services to provide a new composed web-service intended to satisfy some users requirements for which a single web service is not (good) enough. In this article, the formulation of the automatic web-services composition is proposed as several set-cover problems and an approxima...
متن کاملOn the difference between the maximum multiplicity and path cover number for tree-like graphs
For a given undirected graph G, the maximum multiplicity of G is defined to be the largest multiplicity of an eigenvalue over all real symmetric matrices A whose (i, j)th entry is nonzero whenever i 6= j and {i, j} is an edge in G. The path cover number of G is the minimum number of vertex-disjoint paths occurring as induced subgraphs of G that cover all the vertices of G. We derive a formula f...
متن کاملمقایسه روش‌های طبقه‌بندی‌کننده حداکثر مشابهت و حداقل فاصله از میانگین در تهیه نقشه پوشش اراضی (مطالعه موردی: استان اصفهان)
Land cover maps derived from satellite images play a key role in regional and national land cover assessments. In order to compare maximum likelihood and minimum distance to mean classifiers, LISS-III images from IRS-P6 satellite were acquired in August 2008 from the western part of Isfahan. First, the LISS-III image was georeferenced. The Root Mean Square error of less than one pixel was the r...
متن کاملApproximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points
We consider the stochastic graph model where the location of each vertex is a random point in a given metric space. We study the problems of computing the expected lengths of the minimum spanning tree, the minimum perfect matching and the minimum cycle cover on such a stochastic graph and obtain an FPRAS (Fully Polynomial Randomized Approximation Scheme) for each of these problems. Our result f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 16 شماره
صفحات -
تاریخ انتشار 2009